Descent sets of cyclic permutations
نویسنده
چکیده
We present a bijection between cyclic permutations of {1, 2, . . . , n+1} and permutations of {1, 2, . . . , n} that preserves the descent set of the first n entries and the set of weak excedances. This non-trivial bijection involves a Foata-like transformation on the cyclic notation of the permutation, followed by certain conjugations. We also give an alternate derivation of the consequent result about the equidistribution of descent sets using work of Gessel and Reutenauer. Finally, we prove a conjecture of the author in [SIAM J. Discrete Math. 23 (2009), 765–786] and a conjecture of Eriksen, Freij and Wästlund.
منابع مشابه
Analyzing Random Permutations for Cyclic Coordinate Descent
We consider coordinate descent methods on convex quadratic problems, in which exact line searches are performed at each iteration. (This algorithm is identical to Gauss-Seidel on the equivalent symmetric positive definite linear system.) We describe a class of convex quadratic problems for which the random-permutations version of cyclic coordinate descent (RPCD) outperforms the standard cyclic ...
متن کاملDescents of λ-unimodal cyclic permutations
We prove an identity conjectured by Adin and Roichman involving the descent set of λ-unimodal cyclic permutations. These permutations appear in the character formulas for certain representations of the symmetric group and these formulas are usually proven algebraically. Here, we give a combinatorial proof for one such formula and discuss the consequences for the distribution of the descent set ...
متن کاملPattern avoidance in cyclically ordered structures
We generalize the notion of pattern avoidance to arbitrary functions on ordered sets, and consider specifically three scenarios for permutations: linear, cyclic and hybrid, the first one corresponding to classical permutation avoidance. The cyclic modification allows for circular shifts in the entries. Using two bijections, both ascribable to both Deutsch and Krattenthaler independently, we sin...
متن کاملEnumerations of Permutations by Circular Descent Sets
The circular descent of a permutation σ is a set {σ(i) | σ(i) > σ(i + 1)}. In this paper, we focus on the enumerations of permutations by the circular descent set. Let cdesn(S) be the number of permutations of length n which have the circular descent set S. We derive the explicit formula for cdesn(S). We describe a class of generating binary trees Tk with weights. We find that the number of per...
متن کاملThe joint distribution of descent and major index over restricted sets of permutations
We compute the joint distribution of descent and major index over permutations of {1, . . . , n} with no descents in positions {n− i, n− i+ 1, . . . , n− 1} for fixed i ≥ 0. This was motivated by the problem of enumerating symmetrically constrained compositions and generalizes Carlitz’s q-Eulerian polynomial.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009